Closure Functions and Width 1 Problems

نویسندگان

  • Víctor Dalmau
  • Justin Pearson
چکیده

Local Consistency has proven to be an important notion in the study of constraint satisfaction problems. We give an algebraic condition that characterizes all the constraint types for which generalized arc-consistency is suucient to ensure the existence of a solution. We give some examples to illustrate the application of this result.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Influence of lip closure on alveolar cleft width in patients with cleft lip and palate

BACKGROUND The influence of surgery on growth and stability after treatment in patients with cleft lip and palate are topics still under discussion. The aim of the present study was to investigate the influence of early lip closure on the width of the alveolar cleft using dental casts. METHODS A total of 44 clefts were investigated using plaster casts, 30 unilateral and 7 bilateral clefts. Al...

متن کامل

Bounded Depth Arithmetic Circuits: Counting and Closure

Constant-depth arithmetic circuits have been defined and studied in [AAD97, ABL98]; these circuits yield the function classes #AC and GapAC. These function classes in turn provide new characterizations of the computational power of threshold circuits, and provide a link between the circuit classes AC (where many lower bounds are known) and TC (where essentially no lower bounds are known). In th...

متن کامل

A Remark Concerning the Solution of the Dirichlet Problem by Finite Differences

In the classic paper [1] it is proven that the mesh-functions obtained by solving a discrete analogue of the Dirichlet problem converge, as the mesh-width approaches zero, to a harmonic function which solves the Dirichlet problem in a somewhat generalized sense. More precisely, let the function / be continuously differentiable in a bounded plane domain G and continuous in the closure G of G, an...

متن کامل

An Improved Subexponential Bound for On-line Chain Partitioning

Bosek and Krawczyk exhibited an on-line algorithm for partitioning an on-line poset of width w into w lgw chains. They also observed that the problem of on-line chain partitioning of general posets of width w could be reduced to First-Fit chain partitioning of (2w + 1)-ladder-free posets of width w, where an m-ladder is the transitive closure of the union of two incomparable chains x1 6 . . . 6...

متن کامل

مطالعه هیستومورفومتریک اثر سم دیازینون بر پلاک رشد استخوانی موش صحرایی نر

Background: Bone is a hard and dynamic tissue, which continually undergoes remodeling process. Longitudinal growth of bone is mediated by growth plate that is a cartilage structure at the end of long bones. During puberty, along with the closure (ossification) of growth plate, the longitudinal growth of bone will stop. Diazinon is one of the widely used organophosphorus pesticides that have bee...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999